AbstractIn a recent paper by Gargantini, an algorithm for evaluating the connected regions of an image represented as a linear quadtree is presented. This note observes a case where the algorithm fails to provide the correct solution. A modified form is offered together with an analysis of worst-case complexity
An algorithm is presented for constructing a quadtree for a region given its boundary in the form of...
The connectedness property of vertices in a graph is not in general preserved after the removal of g...
The algorithm presented in this paper is for testing whether the connectivity of a large graph of $n...
AbstractIn a recent paper by Gargantini, an algorithm for evaluating the connected regions of an ima...
AbstractAn algorithm is given for the determination of all connected components of a given region. T...
Abstract—In this paper, we have considered the problem of maintaining connected components in quadtr...
An algorithm is presented for labeling the connected components of an image represented by a quadtre...
Spatial data representation and compression has become a focus issue in computer graphics and image...
A modification of the linear quadtree [3], the threaded linear hierarchical quadtree (TLHQT), is pro...
AbstractConnectivity preservation is a concern in the design of image processing algorithms for para...
This paper studies the influence of the definition of neighborhoods and methods used for creating po...
An algorithm is presented which fills contours described by a set of pixels whose locations are give...
The distribution of black leaf nodes at each level of a linear quadtree is of significant interest i...
# The Author(s) 2009. This article is published with open access at Springerlink.com Abstract In ord...
In this paper we review recent advances in connected filtering, with emphasis on attribute filters b...
An algorithm is presented for constructing a quadtree for a region given its boundary in the form of...
The connectedness property of vertices in a graph is not in general preserved after the removal of g...
The algorithm presented in this paper is for testing whether the connectivity of a large graph of $n...
AbstractIn a recent paper by Gargantini, an algorithm for evaluating the connected regions of an ima...
AbstractAn algorithm is given for the determination of all connected components of a given region. T...
Abstract—In this paper, we have considered the problem of maintaining connected components in quadtr...
An algorithm is presented for labeling the connected components of an image represented by a quadtre...
Spatial data representation and compression has become a focus issue in computer graphics and image...
A modification of the linear quadtree [3], the threaded linear hierarchical quadtree (TLHQT), is pro...
AbstractConnectivity preservation is a concern in the design of image processing algorithms for para...
This paper studies the influence of the definition of neighborhoods and methods used for creating po...
An algorithm is presented which fills contours described by a set of pixels whose locations are give...
The distribution of black leaf nodes at each level of a linear quadtree is of significant interest i...
# The Author(s) 2009. This article is published with open access at Springerlink.com Abstract In ord...
In this paper we review recent advances in connected filtering, with emphasis on attribute filters b...
An algorithm is presented for constructing a quadtree for a region given its boundary in the form of...
The connectedness property of vertices in a graph is not in general preserved after the removal of g...
The algorithm presented in this paper is for testing whether the connectivity of a large graph of $n...
DOI
Add to ORKG